Mitigating Bit-Synchronization Errors in Huffman-Coding-Aided Index Modulation
نویسندگان
چکیده
منابع مشابه
Lossless Index Coding for Image Vector Quantization Using Huffman Codes
Image vector quantization (VQ) has many current and future envisioned applications, such as digital image and signal compression, watermarking, data hiding, speaker identification. The idea of lossless index coding is to enhance the performance of image VQ by further encoding the index map of the VQ without introducing extra distortion. A novel lossless index coding scheme, called Index Associa...
متن کاملTime synchronization errors in GPS-aided inertial navigation systems
The effects of time synchronization errors in a GPSaided inertial navigation system (INS) are studied in terms of the increased error covariance of the state vector. Expressions for evaluating the error covariance of the navigation state vector— given the vehicle trajectory and the model of the INS error dynamics—are derived. Two different cases are studied in some detail. The first case consid...
متن کاملQuantum-inspired Huffman Coding
ABSTRACT Huffman Compression, also known as Huffman Coding, is one of many compression techniques in use today. The two important features of Huffman coding are instantaneousness that is the codes can be interpreted as soon as they are received and variable length that is a most frequent symbol has length smaller than a less frequent symbol. The traditional Huffman coding has two procedures: co...
متن کاملGreedy Algorithms: Huffman Coding
Greedy Algorithms: In an optimization problem, we are given an input and asked to compute a structure, subject to various constraints, in a manner that either minimizes cost or maximizes profit. Such problems arise in many applications of science and engineering. Given an optimization problem, we are often faced with the question of whether the problem can be solved efficiently (as opposed to a...
متن کاملDynamic Huffman Coding
Given nonnegative weights (wr, . . . , w,,), the well-known algorithm of Huffman [2] can be used to construct a binary tree with n external nodes and n 1 internal nodes, where the external nodes are labeled with the weights (wr, . . . , w,) in some order. Huffman’s tree has the minimum value of WJ, + * * . + w,,l, over all such binary trees, where lj is the level at which wj occurs in the tree....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Letters
سال: 2019
ISSN: 1089-7798,1558-2558,2373-7891
DOI: 10.1109/lcomm.2018.2889757